Automated Ranking of Hints
نویسنده
چکیده
The importance of hints in an intelligent tutoring system is well understood. The problems however related to their delivering are quite a few. In this paper we propose delivering of hints to be based on considering their usefulness. By this we mean that a hint is regarded as useful to a student if the student has succeeded to solve a problem after the hint was suggested to her/him. Methods from the theory of partial orderings are further applied facilitating an automated process of offering individualised advises on how to proceed in order to solve a particular problem. Keywords—Decision support services, uncertainty management, partial orderings.
منابع مشابه
Why Using Structural Hints in XML Retrieval?
When querying XML collections, users cannot always express their need in a precise way. Systems should therefore support vagueness at both the content and structural level of queries. This paper present a relevance-oriented method for ranking XML components. The aim here is to evaluate whether structural hints help to better answer the user needs. We experiment (within the INEX framework) with ...
متن کاملModeling Hinting Strategies for Geometry Theorem Proving
This study characterizes hinting strategies used by a human tutor to help students learn geometry theorem proving. Current tutoring systems for theorem proving provide hints that encourage (or force) the student to follow a fixed forward and/or backward chaining strategy. In order to find out if human tutors observed a similar constraint, a study was conducted with students proving geometry the...
متن کاملNonuniform Coercions via Unification Hints
We introduce the notion of nonuniform coercion, which is the promotion of a value of one type to an enriched value of a different type via a nonuniform procedure. Nonuniform coercions are a generalization of the (uniform) coercions known in the literature and they arise naturally when formalizing mathematics in an higher order interactive theorem prover using convenient devices like canonical s...
متن کاملAutomatic Generation of a Matching Function by Genetic Programming for Effective Information Retrieval
With the advent of the Internet, online resources are increasingly available. Many users choose popular search engines to perform an online search to satisfy their information need. However, these search engines tend to turn up many non-relevant documents, which make their retrieval precision very low. How to find appropriate ranking metrics to retrieve more relevant documents and fewer non-rel...
متن کاملAn Exploration of Data-Driven Hint Generation in an Open-Ended Programming Problem
Data-driven systems can provide automated feedback in the form of hints to students working in problem solving environments. Programming problems present a unique challenge to these systems, in part because of the many ways in which a single program can be written. This paper reviews current strategies for generating data-driven hints for programming problems and examines their applicability to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011